%0 Conference Proceedings
%4 dpi.inpe.br/vagner/1999/11.26.17.09
%2 sid.inpe.br/banon/2001/03.30.15.57.59
%@doi 10.1109/SIBGRA.1999.805735
%T A simple algorithm for decomposing convex structuring elements
%D 1999
%A Hashimoto, Ronaldo Fumio,
%A Barrera, Junior,
%E Stolfi, Jorge,
%E Tozzi, Clésio Luis,
%B Brazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI)
%C Campinas, SP, Brazil
%8 17-20 Oct. 1999
%I IEEE Computer Society
%J Los Alamitos
%P 275-282
%S Proceedings
%1 SBC - Brazilian Computer Society and UNICAMP - University of Campinas
%K convex structuring element, decomposition, minkowski addition.
%X A finite subset of Z2 is called a structuring element. This paper presents a new and simple algorithm for decomposing a convex structuring element as sequence of Minkowski addition of a minimum number of subsets of the elementary square (i.e., the 3 x 3 square centered at the origin). Besides its simplicity, the advantage of this algorithm over some known algorithms is that it generates a sequence of non necessarily convex subsets, what means subsets with smaller cardinality and, consequently, faster implementation of the corresponding dilations and erosions. The algorithm is based on algebraic and geometrical properties of Minkowski additions. Theoretical analysis of correctness and computacional time complexity are also presented.
%3 020-23414266.pdf
%O The conference was held in Campinas, SP, Brazil, from October 17 to 20.